基于小样本数据的作战计划生成方法

针对部队实兵对抗实验数据生成和采集的投入高、难度大的实际,提出基于小样本数据生成作战计划的方法：首先,采用偏最小二乘回归分析法建立作战因素与作战结果间的多元非线性模型;其次,采用改进的遗传算法,在MATLAB平台编程实现了对模型的整数规划求解,并通过实例验证算法的有效性;最后,利用作战因素的重要性排序分析作战计划的调整流程。     

Higher‐order Markov chain models for categorical data sequences*

In this paper we study higher‐order Markov chain models for analyzing categorical data sequences. We propose an efficient estimation method for the model parameters. Data sequences such as DNA and sales demand are used to illustrate the predicting power of our proposed models. In particular, we apply the developed higher‐order Markov chain model to the server logs data. The objective here is to model the users' behavior in accessing information and to predict their behavior in the future. Our tests are based on a realistic web log and our model shows an improvement in prediction. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2004     

Index policies for the routing of background jobs

Arriving (generic) jobs may be processed at one of several service stations, but only when no other (dedicated) jobs are waiting there. We consider the problem of how to route these incoming background jobs to make best use of the spare service capacity available at the stations. We develop an approximative approach to Whittle's proposal for restless bandits to obtain an index policy for routing. The indices concerned are increasing and nonlinear in the station workload. A numerical study testifies to the strong performance of the index policies developed. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2004     

Scheduling with centralized and decentralized batching policies in concurrent open shops

This article considers batch scheduling with centralized and decentralized decisions. The context of our study is concurrent open shop scheduling where the jobs are to be processed on a set of independent dedicated machines, which process designated operations of the jobs in batches. The batching policy across the machines can be centralized or decentralized. We study such scheduling problems with the objectives of minimizing the maximum lateness, weighted number of tardy jobs, and total weighted completion time, when the job sequence is determined in advance. We present polynomial time dynamic programming algorithms for some cases of these problems and pseudo‐polynomial time algorithms for some problems that are NP‐hard in the ordinary sense. © 2010 Wiley Periodicals, Inc. Naval Research Logistics 58: 17–27, 2011     

类“标枪”导弹两栖登陆反装甲作战弹道仿真分析

两栖登陆作战在战术上是最复杂、最危险的作战行动,登陆部队需要面对抗登陆方坚固的海岸防御背水抢滩作战,其危险性和困难可想而知。"工欲善其事,必先利其器",在兵器上的优势成为克服不利地理条件,形成火力优势的关键。类"标枪"反装甲导弹装备是两栖登陆作战中单兵反装甲作战的主要武器,仿真技术是类"标枪"反装甲导弹武器系统优化设计和性能研究的必要手段。介绍了单项仿真与综合仿真相结合的仿真方法,给出了类"标枪"反装甲导弹的弹道模型,利用Matlab编程语言进行了仿真验证,对改善导弹的弹道性能具有明显的实用价值。     

分布式海战场资源规划问题

分布式海战场资源规划是实现海上联合作战的关键。首先分析了海战场资源的分类及战场资源规划特点,建立了基于多智能体的分布式海战场资源规划系统,深入分析了该规划系统的组成和功能,并构造了相应的资源规划结构模型,为实现定性和定量相结合的海战场资源规划与管理提供了一条有效的途径。     

基于运动合成的小推力轨道优化方法

针对小推力轨道优化设计问题,提出一种基于运动合成的新方法。给出基于运动合成的小推力轨道机动表达方式,将小推力轨道运动分解成相对独立的三项:单独考虑日心引力的二体轨道运动,单独考虑小推力的运动,以及小推力的存在引起的日心引力摄动作用下的运动。分别给出各项运动的解析表达式,通过合成叠加得到小推力轨道的近似解析解。在此基础上,将小推力轨道优化问题转化成非线性规划问题,并利用序列二次规划方法求解。以小行星1989ML、火星和金星交会任务为例分别进行仿真实验,结果表明,所设计轨道满足任务约束,验证了该方法具有可用性和高效性。     

Minimum violations and predictive meta‐rankings for college football

This article presents two meta‐ranking models that minimize or nearly minimize violations of past game results while predicting future game winners as well as or better than leading current systems—a combination never before offered for college football. Key to both is the development and integration of a highly predictive ensemble probability model generated from the analysis of 36 existing college football ranking systems. This ensemble model is used to determine a target ranking that is used in two versions of a hierarchical multiobjective mixed binary integer linear program (MOMBILP). When compared to 75 other systems out‐of‐sample, one MOMBILP was the leading predictive system while getting within 0.64% of the retrodictive optimum; the other MOMBILP minimized violations while achieving a prediction total that was 2.55% lower than the best mark. For bowls, prediction sums were not statistically significantly different from the leading value, while achieving optimum or near‐optimum violation counts. This performance points to these models as potential means of reconciling the contrasting perspectives of predictiveness versus the matching of past performance when it comes to ranking fairness in college football. © 2013 Wiley Periodicals, Inc. Naval Research Logistics 61: 17–33, 2014     

基于SDP松弛的干扰资源优化分配技术研究

提出一种基于semidefinite programming(简称SDP)松弛的干扰资源优化分配算法。在问题优化过程中首先对模型中非凸的约束条件进行松弛,变为凸约束,将原来的数学模型转化成SDP求解形式,利用内点算法对松弛后的模型求解。该算法利用解析的手段使得干扰资源优化分配问题中的NP难问题在多项式时间内得以解决,并且有较高的可靠性。仿真结果验证了算法的有效性。     

燃气轮机仿真软件构造方法综述

从方法论的角度综述了燃气轮机仿真软件的研究现状,分析了过程式方法和过程式模块化方法的不足,阐明采用面向对象方法的必要性,并对未来的发展方向作了初步探讨.